A Purely Logical Characterization of Circuit Uniformity

نویسنده

  • Steven Lindell
چکیده

Utilizing the connection between uniform constantdepth circuits and first-order logic with numerical predicates, we are able to provide a purely logical characterization of uniformity based on the intrinsic properties of these predicates. By requiring a numerical predicate R to satisfy a natural extensibility condition — that it can be translated to a polynomially magnified domain based on tuple constructions — we show that R must already be elementarily definable from < and bit (both of which satisfy the extensibility condition). Our answer is motivated by, and coincides with, DLOGTIME uniformity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Uniformity Within

1 Abstract In order to study circuit complexity classes within NC 1 in a uniform setting, we need a uniformity condition which is more restrictive than those in common use. Two such conditions, stricter than NC 1 uniformity Ru81,Co85], have appeared in recent research: Immerman's families of circuits deened by rst-order formulas Im87a,Im87b] and a uniformity corresponding to Buss' deterministic...

متن کامل

The Lower Reaches of Circuit Uniformity

The effect of severely tightening the uniformity of Boolean circuit families is investigated. The impact on NC and its subclasses is shown to depend on the characterization chosen for the class, while classes such as P appear to be more robust. Tightly uniform subclasses of NC whose separation may be within reach of current techniques emerge.

متن کامل

On Uniformity within NC¹

In order to study circuit complexity classes within NC in a uniform setting we need a uniformity condition which is more restrictive than those in common use Two such conditions stricter than NC uniformity Ru Co have appeared in recent research Immerman s families of circuits de ned by rst order formulas Im a Im b and a unifor mity corresponding to Buss deterministic log time reductions Bu We s...

متن کامل

High Speed Full Swing Current Mode BiCMOS Logical Operators

In this paper the design of a new high-speed current mode BiCMOS logic circuits isproposed. By altering the threshold detector circuit of the conventional current mode logic circuitsand applying the multiple value logic (MVL) approach the number of transistors in basic logicoperators are significantly reduced and hence a reduction of chip area and power dissipation as wellas an increase in spee...

متن کامل

On the characterization of models of H*: The semantical aspect

We give a characterization, with respect to a large class of models of untyped λ-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is H∗ (observations for head normalization). An extensional K-model D is fully abstract if and only if it is hyperimmune, i.e., not well founded chains of elements of D cannot be captured by any recursive functio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992